A Polynomial-Time DNA Computing Solution for the N-Queens Problem
نویسندگان
چکیده
منابع مشابه
Solution for N Queens Problem Using a Photosynthetic Algorith
The process of the reaction of carbon molecules in the dark reaction of photosynthesis was chosen as a BDA (Biosystem-Derived Algorithm). In this study, the BDA was referred to as the 'Photosynthetic Algorithm (PA)'. The PA utilizes the rules governing the conversion of carbon molecules from one substance to another in the Benson-Calvin cycle and Photorespiration reactions. In this paper, the p...
متن کاملA Dynamic Programming Solution to the n-Queens Problem
Rivin, I. and R. Zabih, A dynamic programming solution to the n-queens problem, Information Processing Letters 41 (1992) 253-256. The n-queens problem is to determine in how many ways n queens may be placed on an n-by-n chessboard so that no two queens attack each other under the rules of chess. We describe a simple O( f(n)8”) solution to this problem that is based on dynamic programming, where...
متن کاملUsing Reflexd for a Grid Solution to the N-queens Problem: a Case Study
Aspect-Oriented Programming (AOP) promotes better separation of concerns in software systems by introducing aspects for the modular implementation of crosscutting concerns. It is therefore not surprising that the distribution concern is recently being addressed from anAOP point of view, and finallymaterialized in AOP frameworks like ReflexD or languages like AWED. The motivation of this paper i...
متن کاملSolution of a problem in DNA computing
We answer a question of Rozenberg and Salomaa on a problem in DNA computing that was posed at the ICALP conference in July 1999 in Prague.
متن کاملA Parallel Search Algorithm for the N-Queens Problem
The N-queens problem is to place n queens on an n n chessboard such that no two queens attack each other. This problem is commonly used as a benchmark for algorithms that solve constraint satisfaction problems (CSP). This paper describes a novel parallel algorithm for the N-queens problem. The algorithm nds a solution by performing a probabilistic parallel search. By using n processors, its run...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia - Social and Behavioral Sciences
سال: 2013
ISSN: 1877-0428
DOI: 10.1016/j.sbspro.2013.06.118